Green Measurements for Software Product Based on Sustainability Dimensions

Software is a central component in the modern world and vastly affects the environment’s sustainability. The demand for energy and resource requirements is rising when producing hardware and software units. Literature study reveals that many studies focused on green hardware; however, limited efforts were made in the greenness of software products. Green software products are necessary to solve the issues and problems related to the long-term use of software, especially from a sustainability perspective. Without a proper mechanism for measuring the greenness of a particular software product executed in a specific environment, the mentioned benefits will not be attained. Currently, there are not enough works to address this problem, and the green status of software products is uncertain and unsure. This paper aims to identify the green measurements based on sustainable dimensions in a software product. The second objective is to reveal the relationships between the elements and measurements through empirical study. The study is conducted in two phases. The first phase is the theoretical phase, where the main components, measurements and practices that influence the sustainability of a software product are identified. The second phase is the empirical study that involved 103 respondents in Malaysia investigating current practices of green software in the industrial environment and further identifying the main sustainability dimensions and measurements and their impact on achieving green software products. This study has revealed seven green measurements of software product: Productivity, Usability, Cost Reduction, Employee Support, Energy Efficiency, Resource Efficiency and Tool Support. The relationships are statistically significant, with a significance level of less than 0.01 (p = 0.000). Thus, the hypothesised relationships were all accepted. The contributions of this study revolve around the research perspectives of the measurements to attain a green software product.     

Covariance matrix adaptation evolution strategy based design of fixed structure robust H∞ loop shaping controller

This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H_∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H_∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H_∞ loop-shaping controller is compared with the traditional H_∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H_∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H_∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H_∞ loop shaping controller is suitable for real time implementation with good robust stability and performance.     

Public key distribution scheme for delay tolerant networks based on two-channel cryptography

A delay tolerant network (DTN) is a store carry and forward network characterized by highly mobile nodes, intermittent connectivity with frequent disruptions, limited radio range and physical obstructions. Emerging applications of DTN include rural DTN, vehicular DTN and pocket DTN. The development of DTN raises a number of security-related challenges due to inconsistent network access and unreliable end-to-end network path. One of the challenges is initial secure context establishment as it is unrealistic to assume that public key infrastructure (PKI) is always globally present and available, hence, the public key management becomes an open problem for DTN. In this paper, for the first time, we propose a dynamic virtual digraph (DVD) model for public key distribution study by extending graph theory and then present a public key distribution scheme for pocket DTN based on two-channel cryptography. By distinguishing between owners and carriers, public key exchange and authentication issues in the decentralized pocket DTN environment can be solved by a two-channel cryptography process and our simulation results have proven it.     

An efficient and security dynamic identity based authentication protocol for multi-server architecture using smart cards

Generally, if a user wants to use numerous different network services, he/she must register himself/herself to every service providing server. It is extremely hard for users to remember these different identities and passwords. In order to resolve this problem, various multi-server authentication protocols have been proposed. Recently, Sood et al. analyzed Hsiang and Shih's multi-server authentication protocol and proposed an improved dynamic identity based authentication protocol for multi-server architecture. They claimed that their protocol provides user's anonymity, mutual authentication, the session key agreement and can resist several kinds of attacks. However, through careful analysis, we find that Sood et al.'s protocol is still vulnerable to leak-of-verifier attack, stolen smart card attack and impersonation attack. Besides, since there is no way for the control server CS to know the real identity of the user, the authentication and session key agreement phase of Sood et al.'s protocol is incorrect. We propose an efficient and security dynamic identity based authentication protocol for multi-server architecture that removes the aforementioned weaknesses. The proposed protocol is extremely suitable for use in distributed multi-server architecture since it provides user's anonymity, mutual authentication, efficient, and security.     

深度学习的人体图像半自动标注系统

针对目前数据标注过于依赖硬件、手动数据标注效率低下的问题,提出了基于深度学习的人体图像半自动标注系统.系统通过对算法进行改进,增加人体关键点个数进行特征提取和加入运动信息的约束,提高了视频分阶段标注的准确率.使用真实数据集仿真实验证明了通过深度学习算法进行数据标注的可行性,并且使用半自动标注的速度快、准确率高.     

基于区块链的D2D辅助的MEC资源共享架构

随着终端设备智能化发展与设备到设备（D2D）通信技术的逐渐应用,终端设备可以通过直连链路进行资源共享.为提升网络边缘整体服务能力,提出了一种基于区块链的D2D辅助的多接入边缘计算资源共享架构（BD-MEC）.在BD-MEC下,综合考虑时延、能耗和支付开销等因素,设计了一种基于博弈论的多用户卸载方案,以满足不同用户的服务需求.其次,针对拒绝服务或付款等恶意行为,提出了一种基于智能合约的资源共享协议与争议事件处理方法,利用区块链来强制共享双方遵守资源共享协议,以实现安全的资源共享.仿真结果表明,BD-MEC能有效地降低计算任务的时延、能耗和支付开销.     

Multi-user web service selection based on multi-QoS prediction

In order to find best services to meet multi-user’s QoS requirements, some multi-user Web service selection schemes were proposed. However, the unavoidable challenges in these schemes are the efficiency and effect. Most existing schemes are proposed for the single request condition without considering the overload of Web services, which cannot be directly used in this problem. Furthermore, existing methods assumed the QoS information for users are all known and accurate, and in real case, there are always many missing QoS values in history records, which increase the difficulty of the selection. In this paper, we propose a new framework for multi-user Web service selection problem. This framework first predicts the missing multi-QoS values according to the historical QoS experience from users, and then selects the global optimal solution for multi-user by our fast match approach. Comprehensive empirical studies demonstrate the utility of the proposed method.     

Reprint of “Virtual cut-through: A new computer communication switching technique”

In this paper a new switching technique called virtual cut-through is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediate node and its selected outgoing channel is free (just after the reception of the header), then, in contrast to message switching, the message is sent out to the adjacent node towards its destination before it is received completely at the node; only if the message is blocked due to a busy output channel is a message buffered in an intermediate node. Therefore, the delay due to unnecessary buffering in front of an idle channel is avoided. We analyze and compare the performance of this new switching technique with that of message switching with respect to three measures: network delay, traffic gain and buffer storage requirement. Our analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.

1. Download : Download full-size image

     

Multi-party quantum private comparison protocol with n-level entangled states

In this paper, two multi-party quantum private comparison (MQPC) protocols are proposed in distributed mode and traveling mode, respectively. Compared with the first MQPC protocol, which pays attention to compare between arbitrary two participants, our protocols focus on the comparison of equality for \(n\) participants with a more reasonable assumption of the third party. Through executing our protocols once, it is easy to get if \(n\) participants’ secrets are same or not. In addition, our protocols are proved to be secure against the attacks from both outside attackers and dishonest participants.